97. Interleaving String - LeetCode Solution


Dynamic programming

Python Code:

class Solution:
    def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
        dp = []
        
        if len(s1) + len(s2) != len(s3):
            return False
        

        for i in range(len(s1)+1):
            a = []

            for j in range(len(s2)+1):
                a.append(-1)
            dp.append(a)


        def trav(s1, s2, s3, ptr1, ptr2, ptr3):
            if ptr3 == len(s3):
                return True

            if dp[ptr1][ptr2] != -1:
                return dp[ptr1][ptr2]


            a =b= False
            if ptr1 != len(s1) and s1[ptr1] == s3[ptr3]:
                a = trav(s1, s2, s3, ptr1+1, ptr2, ptr3 + 1)
            if ptr2 != len(s2)  and s2[ptr2] == s3[ptr3]:
                b = trav(s1, s2, s3, ptr1, ptr2 + 1, ptr3 + 1)

            dp[ptr1][ptr2] = a or b
            return dp[ptr1][ptr2]


        return trav(s1, s2, s3, 0, 0, 0)


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST